Repository navigation
Conversation
Codecov Report❌ Patch coverage is Additional details and impacted files@@ Coverage Diff @@
## main #2623 +/- ##
============================================
+ Coverage 71.52% 72.16% +0.64%
- Complexity 51097 51106 +9
============================================
Files 1644 2097 +453
Lines 198406 226507 +28101
Branches 38581 38587 +6
============================================
+ Hits 141900 163459 +21559
- Misses 45365 51903 +6538
- Partials 11141 11145 +4
Flags with carried forward coverage won't be shown. Click here to find out more. ☔ View full report in Codecov by Harness. 🚀 New features to boost your workflow:
|
…va class to not being exclusive for read instructions
…multiplication chain into their own statement block
…parate method for processing the children of matrix multiplication hops chore(test/functions/rewrite/RewriteSplitDagUnkownNnzReadTest.java): update assert string check to the new version of the log output
… into separate statement block only before the chain instead of before and after the chain
…nd AFTER the MM chain regardless of whether input nnz are known or not NOTE: Thereby, we create a separate statement block for every mm chain, in which we can optimize and rewrite the mm chain isolated from other operations.
…include loops in DAG
…pendencies (part 1)
…wo separate test cases for read and mm chain
…e function to recursive instead of relying on layer structure through a list
… creating duplicated statement blocks
…chains with at least two matrix multiplications
…n abstract class for common functionality of rewrite rules that split statement blocks refactor(main/hops/rewrite/RewriteSplit**.java): extend the newly created abstract class for spit statement blocks functionality
…name rewrite class refactor(main/test/functions/rewrite/RewriteSplitDagSparsityRecompileTest.java): rename test related to the renamed rewrite class
ywcb00
force-pushed
the
feat/recompile/sparsity/mmchain
branch
from
October 23, 2026 14:38
8a3d7ef to
981362f
Compare
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Hello there,
this PR splits the inputs of a matrix multiplication chain into their own statement block to ensure the MM chain receives correct sparsity information as input (i.e., the sparsity is computed before sparsity rewrites).
The tests are modified accordingly.
All the best,
David